//求子集的最大集合

function findMin(nums) {
    let sum = 0; //最大和
    //数组重组
    let i = 0;
    while (i < nums.length) {
        let temp = Number(arr[i]);
        let p = i;
        while (p < nums.length) {
            temp += Number(arr[p]);
            if (temp % 7 == 0 && temp > sum) {
                sum = temp;
            }
        }
        i++;
    }
    if (sum === 0) {
        return -1;
    }
    return sum;
}